Unified Domains and Abstract Computational Structures
نویسندگان
چکیده
This paper introduces a formalism to specify abstract computational structures (ACS) of mathematical domains of computation. This is a basic step of a project aiming at designing an environment for symbolic computing based upon knowledge representation and relying, when needed, on AI methods. We present a method for the speciication of these ACS's which is embedded in the framework of algebraic speciications and of uniied domains. The rst part of this paper deals with the theoretical solution of this speciication problem. The second part reports on the implementation in the hybrid knowledge representation system MANTRA.
منابع مشابه
Solution of Thermo-Fluid problems in Bounded Domains via the Numerical Panel Method
The classical panel method has been extensively used in external aerodynamics to calculate ideal flow fields around moving vehicles or stationary structures in unbounded domains. However, the panel method, as a somewhat simpler implementation of the boundary element method, has rarely been employed to solve problems in closed complex domains. This paper aims at filling this gap and discusses th...
متن کاملA numerical approach for variable-order fractional unified chaotic systems with time-delay
This paper proposes a new computational scheme for approximating variable-order fractional integral operators by means of finite element scheme. This strategy is extended to approximate the solution of a class of variable-order fractional nonlinear systems with time-delay. Numerical simulations are analyzed in the perspective of the mean absolute error and experimental convergence order. To ill...
متن کاملCertain Concepts in Intuitionistic Neutrosophic Graph Structures
Abstract: A graph structure is a generalization of simple graphs. Graph structures are very useful tools for the study of different domains of computational intelligence and computer science. In this research paper, we introduce certain notions of intuitionistic neutrosophic graph structures. We illustrate these notions by several examples. We investigate some related properties of intuitionist...
متن کاملExploring Application Domains for Computational Creativity
We are motivated by the recent application of computational creativity in the culinary domain. Given the increasing commercial importance of data-driven computation, we explore and provide unified framework in three new domains to which computational creativity can be applied and yield business value. The three domains are travel, fashion, and science. Reflecting on the framework characterizati...
متن کاملStable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication)
We study orderings £S on reductions in the style of Lévy reflecting the growth of information w.r.t. (super)stable sets S of ‘values’ (such as head-normal forms or Böhm-trees). We show that sets of co-initial reductions ordered by £S form finitary ω-algebraic complete lattices, and hence form computation and Scott domains. As a consequence, we obtain a relativized version of the computational s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992